Geographical Routing Problem of Wireless Sensor Networks with Multiple Mobile Sinks
نویسنده
چکیده
In this study, the problem of building Level-based topologies for Wireless Sensor Networks with several sinks is considered. The optimization relies on different levels of decision: choosing which sensors are masters and balancing the load among sinks, in order to prolong the network life time and improve its scalability. In this paper we present an enhancement to the GRPW algorithm for wireless sensor networks. Performance of GRPW algorithm depends heavily on single sink position , we propose a protocol based on Multiple Static Sinks, we modified the existing sink location privacy protection scheme by dividing nodes in the network containing multiple sink into different levels in which real packets are forwarded to sink belong to corresponding logical levels and the intermediate node generating fake packets and sending it to fake sinks. Using OMNET++ simulation and the MiXiM framework, it is shown that proposed protocol significantly improves the robustness and adapts to rapid topological changes with multiple sinks, while efficiently reducing the communication overhead and the energy consumption . Keywords—Wireless Sensor Network (WSN), Routing, Multiple Sink, Localization, Geographic Routing
منابع مشابه
An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملA Secure Routing Algorithm for Underwater Wireless Sensor Networks
Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...
متن کاملGRPW-MuS: Geographic Routing to Multiple Sinks in connected wireless sensor networks
Multiple sinks routing is envisioned as a possible solution to the bottleneck research problem in Wireless Sensor Networks (WSN). In addition to focusing on minimizing the energy consumption in a WSN, it is also equally important to design routing protocols that fairly and evenly distribute the network traffic; in order to prolong the network life time and improve its scalability.In this paper ...
متن کاملA multiple criteria algorithm for planning the itinerary of mobile sink in wireless sensor networks
The mobile sink can increase the efficiency of wireless sensor networks. It moves in a monitored environment and collects the network nodes information. Thus, by the sink we can balance the power consumption and increases the network lifetime. Determining path of the sink's movement is usually modeled as an optimization problem where finding optimal solutions require collecting value of all the...
متن کامل